Generalised k-variable-mixed-polarity Reed-Muller expansions for system of Boolean functions and their minimisation

نویسنده

  • C. - H. Chang
چکیده

A lookup table based method to minimise generalised partially-mixed-polarity ReedMuller (GPMPRM) expansions with k mixed polarity variables is presented. The developed algorithm can produce solutions based on the desired cost criteria for the systems of completely specified functions. A heuristic approach based on the exclusion rule is adopted to extract the best dual polarity variables from any fxed polarity Reed-Muller (FPRM) expansion. The obtained experimental results compared favourably with the recently published results and outperform those generated by the exact minimal FPRM expansion minimisers.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Calculation of the Reed-muller Form by Means of the Walsh Transform

The paper describes a spectral method for combinational logic synthesis using the Walsh transform and the Reed-Muller form. A new algorithm is presented that allows us to obtain the mixed polarity Reed-Muller expansion of Boolean functions. The most popular minimisation (sub-minimisation) criterion of the Reed-Muller form is obtained by the exhaustive search of all the polarity vectors. This pa...

متن کامل

Algorithms in computer-aided design of VLSI circuits

With the increased complexity of Very Large Scale Integrated (VLSI) circuits, Computer Aided Design (CAD) plays an even more important role. Top-down design methodology and layout of VLSI are reviewed. Moreover, previously published algorithms in CAD of VLSI design are outlined. In certain applications, Reed-Muller (RM) forms when implemented with AND/XOR or OR/XNOR logic have shown some attrac...

متن کامل

On the Calculation of Generalized Reed-muller Canonical Expansions from Disjoint Cube Representation of Boolean Functions

A new algorithm is shown that converts disjoint cube representation of Boolean functions into fixed-polarity Generalized Reed-Muller Expansions (GRME). Since the known fast algorithm Ihal generates the GRME based on the factorization or thc Reed-Muller transform matrix always starts from the truth table (minterms) of Boolean function, then the described method has the advantages due to smaller ...

متن کامل

Experiences of using Evolutionary Techniques in Logic Minimisation

This paper reviews our work in recent years applying Evolutionary Techniques to the minimisation of logic functions. This work has primarily concerned AND-EXOR (Reed-Muller Logic) networks, as distinct from the more traditional Boolean form (AND-OR). We have also applied these techniques to the minimisation of the logic required to realise sequential state machines (State Assignment Problem). R...

متن کامل

Fixed Polarity Reed-muller Minimization of Incompletely Specified Boolean Functions Based on Information Estimations on Decision Trees

This paper presents algorithm to find minimal Fixed Polarity Reed-Muller expressions, twolevel fixed polarity AND-EXOR canonical representations, for incompletely specified Boolean functions that based on information measures on decision trees. We study the Free Reed-Muller Tree as acceptable representation and manipulation structure to find minimal Fixed Polarity Reed-Muller expressions. In co...

متن کامل

ذخیره در منابع من

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004